Spanders: Distributed spanning expanders
نویسندگان
چکیده
منابع مشابه
Expanders via random spanning trees
Motivated by the problem of routing reliably and scalably in a graph, we introduce the notion of a splicer, the union of spanning trees of a graph. We prove that for any bounded-degree nvertex graph, the union of two random spanning trees approximates the expansion of every cut of the graph to within a factor of O(log n). For the random graph Gn,p, for p = Ω(log n/n), we give a randomized algor...
متن کاملExpanders are universal for the class of all spanning trees
Given a class of graphs F , we say that a graph G is universal for F , or F-universal, if every H ∈ F is contained in G as a subgraph. The construction of sparse universal graphs for various families F has received a considerable amount of attention. One is particularly interested in tight F-universal graphs, i. e., graphs whose number of vertices is equal to the largest number of vertices in a...
متن کاملA Fully Distributed (Minimal) Spanning Tree Algorithm
In this paper, we consider a connected undirected graph with n nodes. An asynchronous dist r ibuted algori thm is described which determines a spanning tree of the graph. Moreover, if the edges of the graph are weighted, the same algorithm can compute a minimum-weighted spanning tree. This algori thm can be favourably compared to the one of Gallagher et al. [6] in the following way: identical a...
متن کاملWhat Features Really Make Distributed Minimum Spanning
Since Gallager, Humblet and Spira rst introduced the distributed Minimum Spanning Tree problem , many authors have suggested ways to enhance their basic algorithm to improve its performance. Most of these improved algorithms have even been shown to be very eecient in terms of reducing their worst-case communications and/or time complexity measures. In this paper, however, we take a diierent app...
متن کاملWireless Expanders
This paper introduces an extended notion of expansion suitable for radio networks. A graph G = (V,E) is said to be an (αw, βw)-wireless expander if for every subset S ⊆ V s.t. |S| ≤ αw · |V |, there exists a subset S′ ⊆ S s.t. there are at least βw · |S| vertices in V \S that are adjacent in G to exactly one vertex in S′. The main question we ask is the following: to what extent are ordinary ex...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 2013
ISSN: 0167-6423
DOI: 10.1016/j.scico.2012.10.001